The nullity of(k-1)-cyclic graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the nullity of graphs

The nullity of a graph G, denoted by η(G), is the multiplicity of the eigenvalue zero in its spectrum. It is known that η(G) ≤ n − 2 if G is a simple graph on n vertices and G is not isomorphic to nK1. In this paper, we characterize the extremal graphs attaining the upper bound n− 2 and the second upper bound n− 3. The maximum nullity of simple graphs with n vertices and e edges, M(n, e), is al...

متن کامل

Ela on the Nullity of Graphs

The nullity of a graph G, denoted by η(G), is the multiplicity of the eigenvalue zero in its spectrum. It is known that η(G) ≤ n − 2 if G is a simple graph on n vertices and G is not isomorphic to nK1. In this paper, we characterize the extremal graphs attaining the upper bound n− 2 and the second upper bound n− 3. The maximum nullity of simple graphs with n vertices and e edges, M(n, e), is al...

متن کامل

The Statistical Mechanics ofk

The satissability of random CNF formulae with precisely k variables per clause (\k-SAT") is a popular testbed for the performance of search algorithms. Formulae have M clauses from N variables, randomly negated, keeping the ratio = M=N xed. For k = 2, this model has been proven to have a sharp threshold at = 1 between formulae which are almost aways satissable and formulae which are almost neve...

متن کامل

The Canonical Class and the C 1 Properties ofK ahler

We give a self contained proof that for KK ahler surfaces with non-negative Kodaira dimension, the canonical class of the minimal model and the (?1)-curves are oriented diieomorphism invariants up to sign. This includes the case pg = 0. It implies that the Kodaira dimension is determined by the underlying diierentiable manifold. We then reprove that the multiplicities of the elliptic bration ar...

متن کامل

On the nullity of line graphs of trees

The spectrum of a graph G is the set of eigenvalues of the 0–1 adjacency matrix of G. The nullity of a graph is the number of zeros in its spectrum. It is shown that the nullity of the line graph of a tree is at most one. c © 2001 Elsevier Science B.V. All rights reserved.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2013

ISSN: 0024-3795

DOI: 10.1016/j.laa.2012.11.033